Constructing high order elements through subspace polynomials
نویسندگان
چکیده
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has not been solved satisfactorily. In this paper, we present an algorithm that for any positive integer c and prime power q, finding an element of order exp(Ω( √ qc)) in the finite field Fq(qc−1)/(q−1) in deterministic time (q). We also show that there are exp(Ω( √ qc)) many weak keys for the discrete logarithm problems in those fields with respect to certain bases.
منابع مشابه
Constructing Two-Dimensional Multi-Wavelet for Solving Two-Dimensional Fredholm Integral Equations
In this paper, a two-dimensional multi-wavelet is constructed in terms of Chebyshev polynomials. The constructed multi-wavelet is an orthonormal basis for space. By discretizing two-dimensional Fredholm integral equation reduce to a algebraic system. The obtained system is solved by the Galerkin method in the subspace of by using two-dimensional multi-wavelet bases. Because the bases of subs...
متن کاملOn quasi-exactly solvable matrix models
An efficient procedure for constructing quasi-exactly solvable matrix models is suggested. It is based on the fact that the representation spaces of representations of the algebra sl(2,R) within the class of first-order matrix differential operators contain finite dimensional invariant subspaces. The Lie-algebraic approach to constructing quasi-exactly solvable one-dimensional stationary Schröd...
متن کاملOn Rigid Matrices and Subspace Polynomials
We introduce a class of polynomials, which we call subspace polynomials and show that the problem of explicitly constructing a rigid matrix can be reduced to the problem of explicitly constructing a small hitting set for this class. We prove that small-bias sets are hitting sets for the class of subspace polynomials, though their size is larger than desired. Furthermore, we give two alternative...
متن کاملNumerical approximation based on the Bernouli polynomials for solving Volterra integro-differential equations of high order
In this article, an applied matrix method, which is based on Bernouli Polynomials, has been presented to find approximate solutions of high order Volterra integro-differential equations. Through utilizing this approach, the proposed equations reduce to a system of algebric equations with unknown Bernouli coefficients. A number of numerical illustrations have been solved to assert...
متن کاملTrajectory Planning Using High Order Polynomials under Acceleration Constraint
The trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. A common way to create trajectories is to deal with polynomials which have independent coefficients. This paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012